Congruence Lattices of Finite Semimodular Lattices

نویسنده

  • G. GRÄTZER
چکیده

We prove that every finite distributive lattice can be represented as the congruence lattice of a finite (planar) semimodular lattice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruence-preserving Extensions of Finite Lattices to Semimodular Lattices

We prove that every finite lattice has a congruence-preserving extension to a finite semimodular lattice.

متن کامل

Finite distributive lattices are congruence lattices of almost- geometric lattices

A semimodular lattice L of finite length will be called an almost-geometric lattice, if the order J(L) of its nonzero join-irreducible elements is a cardinal sum of at most two-element chains. We prove that each finite distributive lattice is isomorphic to the lattice of congruences of a finite almost-geometric lattice.

متن کامل

Frankl's Conjecture for a subclass of semimodular lattices

 In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...

متن کامل

Slim Semimodular Lattices. I. A Visual Approach

A finite lattice L is called slim if no three join-irreducible elements of L form an antichain. Slim lattices are planar. Slim semimodular lattices play the main role in [3], where lattice theory is applied to a purely group theoretical problem. After exploring some easy properties of slim lattices and slim semimodular lattices, we give two visual structure theorems for slim semimodular lattices.

متن کامل

Congruence Lattices of Algebras— the Signed Labelling

For an arbitrary algebra A a new labelling, called the signed labelling, of the Hasse diagram of Con A is described. Under the signed labelling, each edge of the Hasse diagram of Con A receives a label from the set {+,−}. The signed labelling depends completely on a subset of the unary polynomials of A and its inspiration comes from semigroup theory. For finite algebras, the signed labelling co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996